Unimodular integer circulants

نویسنده

  • John Cremona
چکیده

We study families of integer circulant matrices and methods for determining which are unimodular. This problem arises in the study of cyclically presented groups, and leads to the following problem concerning polynomials with integer coefficients: given a polynomial f(x) ∈ Z[x], determine all those n ∈ N such that Res(f(x), xn − 1) = ±1. In this paper we describe methods for resolving this problem, including a method based on the use of Strassman’s Theorem on p-adic power series, which are effective in many cases. The methods are illustrated with examples arising in the study of cyclically presented groups and further examples which illustrate the strengths and weaknesses of the methods for polynomials of higher degree. 1. Statement of the problem and preliminary results In the study of cyclically presented groups (see [8], [6], [7], [17], and [10, Chapter 16]), the following problem arises. Let f = ∑d i=0 aix i be a polynomial of degree d with integer coefficients. Set ai = 0 for i > d. For each n > d we may form the circulant matrix Mn(f) of size n whose first row is (a0, a1, . . . , an−1). Problem A. Given f ∈ Z[x], determine all n > deg(f) such that detMn(f) = ±1. We see below that this is essentially equivalent to the following problem about integer polynomials. Problem B. Given f ∈ Z[x], determine all n ∈ N such that Res(f(x), x−1) = ±1. In this section we give some elementary preliminary results, most of which may be found in [10, Chapter 16] and [14], starting with the reduction of Problem A to Problem B in Lemma 1. In the subsequent sections we describe two methods for solving the problem: the first only requires the use of approximations to the complex roots of f and is guaranteed to work provided that none of these roots lies on the unit circle; the second uses Strassman’s Theorem on p-adic power series. The latter has been found to work in practice, at least for polynomials whose degree is small; further remarks on its general effectiveness will be made later. We also discuss the question of how to determine for a given integer polynomial whether or not any of its complex roots do lie on the unit circle, and we give a simple method for this. Received by the editor June 6, 2007 and, in revised form, July 26, 2007. 2000 Mathematics Subject Classification. Primary 11C08, 11C20, 15A36.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices

We call a matrix A nearly totally unimodular if it can be obtained from a totally unimodular matrix à by adding to each row of à an integer multiple of some fixed row a of Ã. For an integer vector b and a nearly totally unimodular matrix A, we denote by PA,b the integer hull of the set {x ∈ R | Ax ≤ b}. We show that PA,b has the integer decomposition property and that we can find a decompositio...

متن کامل

Unimodular Probing for Minimal Perturbance in Dynamic Resource Feasibility Problems

This paper describes unimodular probing { a new technique that has been used to solve a class of dynamic scheduling problems. In benchmarks a unimodular probing algorithm has outperformed two well-established approaches: backtrack search with local consistency and spe-cialised heuristics, and mixed integer programming (MIP). The problems amenable to unimodular probing involve disjunctive constr...

متن کامل

Affiliation of

Figure 1. (a) Example of loop nest. (b)Bounded iteration space (BIS) for this loop nest. Figure 2. (a) TIS obtained through a unimodular transformation. (b) TIS obtained through a non-unimodular transformation. White and black dots represent points of the TIS with integer antiimage. The black dots represent the points of the BTIS with integer antiimage. Figure 3. Parameters which characterize t...

متن کامل

Optimal Factorization in Lattice-Reduction-Aided and Integer-Forcing Linear Equalization

Lattice-reduction-aided (LRA) equalization is a very interesting multi-user equalization technique as it enables a lowcomplexity full-diversity detection. To this end, the multipleinput/multiple-output channel is factorized into a reduced variant and a unimodular integer matrix. Inspired by the closely related finite-field processing strategy of integer-forcing (IF) equalization, this factoriza...

متن کامل

Convex Approximations for Totally Unimodular Integer Recourse Models: A Uniform Error Bound

We consider a class of convex approximations for totally unimodular (TU) integer recourse models and derive a uniform error bound by exploiting properties of the total variation of the probability density functions involved. For simple integer recourse models this error bound is tight and improves the existing one by a factor 2, whereas for TU integer recourse models this is the first nontrivia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 77  شماره 

صفحات  -

تاریخ انتشار 2008